Existential Fixed-Point Logic
نویسندگان
چکیده
The purpose of this paper is to draw attention to existential fixed-point logic. Among other things, we show that: (1) If a structure A satisfies an existential fixed-point formula φ, then A has a finite subset F such that every structure B with A |F = B |F satisfies φ. (2) Using existential fixed-point logic instead of first-order logic removes the expressivity hypothesis in Cook's completeness theorem for Hoare logic. (3) In the presence of a successor relation, existential fixed-point logic captures polynomial time.
منابع مشابه
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog
A natural liberalization of Datalog is used in the Distributed Knowledge Authorization Language (DKAL). We show that the expressive power of this liberal Datalog is that of existential fixed-point logic. The exposition is self-contained.
متن کاملLeast Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles
Computing least common subsumers (Ics) and most specific concepts (msc) are inference tasks that can support the bottom-up construction of knowledge bases in description logics. In description logics with existential restrictions, the most specific concept need not exist if one restricts the attention to concept descriptions or acyclic TBoxes. In this paper, we extend the notions les and msc to...
متن کاملNegation and Inductive Norms
In 1982, N. Immerman proved that (positive) least fixed point logic was closed under negation. He used a construction similar to that of Moschovakis [34]: if a logic admits an “inductive norm” that partitions a relation into blocks labelled by integers, then an appropriate “stage comparison relation” might be used to construct a negation of that relation within that logic. In this paper, we gen...
متن کاملExpressive power of monadic logics on words, trees, pictures, and graphs
We give a survey of the expressive power of various monadic logics on specific classes of finite labeled graphs, including words, trees, and pictures. Among the logics we consider, there are monadic secondorder logic and its existential fragment, the modal mu-calculus, and monadic least fixed-point logic. We focus on nesting-depth and quantifier alternation as a complexity measure of these logics.
متن کاملTerminological Cycles in a Description Logic with Existential Restrictions
Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This paper investigates subsumption in the presence of terminological cycles fo...
متن کامل